Infinite chromatic games
نویسندگان
چکیده
In the paper we introduce a new variant of graph coloring game and parameter being result game. We study their properties get some lower upper bounds, exact values for complete multipartite graphs optimal, often polynomial-time strategies both players provided that is played on with an odd number vertices. At end show games, classic one, are related: our bound chromatic number.
منابع مشابه
Infinite-chromatic Graph of Gyarfas
Gyarfas has recently constructed an elegant new example of a trianglefree infinite graph G with infinite chromatic number. We analyze its structure by studying the properties of a nested family of subgraphs G whose union is G.
متن کاملOn Chromatic Number of Infinite Graphs
In our paper [1.] using a special set-theoretical construction assuming the generalized continuum hypothesis (G.C.H . in what follows) we proved that the topological product of J~k discrete topological spaces of power J~ o is not k-compact for every k < co . Since then several related or equivalent problems were independently discussed in the literature . General results of A . TARSKI, P. HANF ...
متن کاملStill another triangle-free infinite-chromatic graph
We give a new example of a triangle-free cc-chromatic graph: the vertices of G form a oox oo matrix, V(G) = [vi,i], i, j = 1, 2, ... The vertex vi,i is connected with every vertex of the ( i + j)th column. G is triangle-free: if A has the smallest column-index among {A, B, C}c V(G) and AB, ACEE(G), then B, Care in the same column so BC¢E(G). G is infinite-chromatic: ~ ~ {1, 2, ... } denotes the...
متن کاملInfinite-Duration Bidding Games
Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study th...
متن کاملAdmissibility in Infinite Games
We analyse the notion of iterated admissibility, i.e., avoidance of weakly dominated strategies, as a solution concept for extensive games of infinite horizon. This concept is known to provide a valuable criterion for selecting among multiple equilibria and to yield sharp predictions in finite games. However, generalisations to the infinite are inherently problematic, due to unbounded dominance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.11.020